Average liar count for degree-$2$ Frobenius pseudoprimes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Frobenius pseudoprimes

The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word “pseudoprime” in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas pseudoprimes, extra strong Lucas pseudoprimes and Perrin pseudoprimes. Though these tests represent a wealth of ideas, they exist as a hodge-podge of definiti...

متن کامل

Average Frobenius Distribution for the Degree Two Primes of a Number Field

Let K be a number field and r an integer. Given an elliptic curve E, defined over K, we consider the problem of counting the number of degree two prime ideals of K with trace of Frobenius equal to r. Under certain restrictions on K, we show that “on average” the number of such prime ideals with norm less than or equal to x satisfies an asymptotic identity that is in accordance with standard heu...

متن کامل

Average Degree-Eccentricity Energy of Graphs

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

متن کامل

Average Frobenius Distribution of Elliptic Curves

The Sato-Tate conjecture asserts that given an elliptic curve without complex multiplication, the primes whose Frobenius elements have their trace in a given interval (2α √ p, 2β √ p) have density given by 2 π R β α √ 1− t2 dt. We prove that this conjecture is true on average in a more general setting.

متن کامل

Generalized Frobenius Numbers: Bounds and Average Behavior

Let n ≥ 2 and s ≥ 1 be integers and a = (a1, . . . , an) be a relatively prime integer n-tuple. The s-Frobenius number of this ntuple, Fs(a), is defined to be the largest positive integer that cannot be represented as ∑n i=1 aixi in at least s different ways, where x1, ..., xn are non-negative integers. This natural generalization of the classical Frobenius number, F1(a), has been studied recen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2019

ISSN: 0025-5718,1088-6842

DOI: 10.1090/mcom/3452